Efficient topology preserving triangular remeshing algorithm with adaptive vertices insertion
نویسندگان
چکیده
منابع مشابه
Topology Preserving Thinning of Vector Fields on Triangular Meshes
We consider the topology of piecewise linear vector fields whose domain is a piecewise linear 2-manifold, i.e. a triangular mesh. Such vector fields can describe simulated 2-dimensional flows, or they may reflect geometric properties of the underlying mesh. We introduce a thinning technique which preserves the complete topology of the vector field, i.e. the critical points and separatrices. As ...
متن کاملBi - adaptive algorithm for efficient and feature preserving mesh denoising
In this paper we define a new bi-adaptive mesh denoising algorithm for efficient features preserving restoration of noisy models acquired from 3D scanners. The new filter is based on two recently introduced adaptive algorithms for triangle mesh denoising which show good results over previous methods. We adapt the MMSE filter noise threshold adaptive equation to compute new triangles normal vect...
متن کاملA Topology-Preserving Voxelization Shrinking Algorithm
Recognition of 3-dimensional objects with complex internal geometries relies more heavily on topology than external shape. We discuss a novel voxelization rescaling algorithm intended to preserve topological structure even at low resolutions, appropriate for artistic reproductions of complex geometries. Introduction: Voxels and Motivations Voxels are the 3-dimensional analog of pixels; a filled...
متن کاملFeature-Preserving Image Restoration from Adaptive Triangular Meshes
The triangulation of images has become an active research area in recent years for its compressive representation and ease of image processing and visualization. However, little work has been done on how to faithfully recover image intensities from a triangulated mesh of an image, a process also known as image restoration or decoding from meshes. The existing methods such as linear interpolatio...
متن کاملGeodesic Computation for Adaptive Remeshing
This video presents an application of geodesic computation on 3D meshes to surface remeshing. The farthest point paradigm [1] is a powerful greedy algorithm that allows fast and accurate sampling of the underlying surface. The use of a varying speed function for front propagation enables an adaptive placement of the seed points. The connectivity of the resulting mesh is computed using a geodesi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2016
ISSN: 0307-904X
DOI: 10.1016/j.apm.2016.01.001